%
% File acl2012.tex
%
% Contact: Maggie Li (cswjli@comp.polyu.edu.hk), Michael White (mwhite@ling.osu.edu)
%%
%% Based on the style files for ACL2008 by Joakim Nivre and Noah Smith
%% and that of ACL2010 by Jing-Shin Chang and Philipp Koehn


\documentclass[letterpaper]{article}
\usepackage{aaai}
%\usepackage{aaaimod}
\usepackage{amsmath}
\usepackage{amsfonts}   % if you want the fonts
\usepackage{amssymb}
\usepackage{algorithm}
\usepackage{algorithmic}
\usepackage{graphicx}
\usepackage{times}
\usepackage{latexsym}
\usepackage{multirow}
\usepackage{url}
\usepackage{lipsum}
\usepackage{theorem}
\usepackage{times}
\usepackage{latexsym}
\usepackage{amsmath}
\usepackage{multirow}
\usepackage{url}
\usepackage{subfig}

\DeclareMathOperator*{\argmax}{arg\,max}
%\setlength\titlebox{6.5cm}    % Expanding the titlebox

\title{Ontological Smoothing for Relation Extraction}

\input{weld-defns-edited}
\newcommand{\sys}{\mbox{\sc Velvet}}   % afar
\newcommand{\tg}[1]{\mbox{$\hat{#1}$}}
\newcommand{\bg}[1]{\mbox{$#1$}}

\newcommand{\match}[2]{\mbox{$#1\cong #2$}}
\newcommand{\mtb}[1]{\mbox{$\tg{#1}\cong \bg{#1}$}}
\newcommand{\mtbs}[2]{\mbox{$\tg{#1}_{#2}\cong \bg{#1}_{#2}$}}

\newcommand{\notmatch}[2]{\mbox{$#1\not\cong #2$}}
\newcommand{\notmtb}[1]{\mbox{$\tg{#1}\not\cong \bg{#1}$}}
\newcommand{\notmtbs}[2]{\mbox{$\tg{#1}_{#2}\not\cong \bg{#1}_{#2}$}}
\newcommand{\mtt}[1]{\mbox{$\tt{#1}$}}
%instance
\newcommand{\ist}[3]{\mbox{$(#1,#2)\in #3$}}
\newcommand{\nisttg}[2]{\mbox{$(\tg{#1}_1,\tg{#1}_2)\not\in \tg{#2}$}}
\newcommand{\isttg}[2]{\mbox{$(\tg{#1}_1,\tg{#1}_2)\in \tg{#2}$}}
\newcommand{\istbg}[2]{\mbox{$(\bg{#1}_1,\bg{#1}_2)\in \bg{#2}$}}
\newcommand{\tist}[2]{\mbox{$#1\in #2$}}
\newcommand{\tistbg}[2]{\mbox{$\bg{#1} \in \bg{#2}$}}
\newcommand{\tisttg}[2]{\mbox{$\tg{#1} \in \tg{#2}$}}

%added by Raphael, based on Dan's edits to section 2.1
\newcommand{\B}[1]{\mbox{$B^{#1}$}}
\newcommand{\T}[1]{\mbox{$T^{#1}$}}
\theoremstyle{plain} \newtheorem{example}{Example}

\begin{document}

 \maketitle
\vspace*{-2cm}
\begin{abstract}
 There is increasing interest in {\em relation
extraction}, methods that convert natural language text into
structured knowledge. The most successful techniques use supervised
machine learning to generate extractors from sentences which have
been labeled with the arguments of the relations of interest.
Unfortunately, these methods require hundreds or thousands of
training examples, which are expensive and time-consuming to
produce.

This paper presents {\em ontological smoothing}, a semi-supervised
technique that exploits knowledge of a background ontology in order
to learn extractors for a set of minimally-labeled relations.
Ontological smoothing has three phases. The first step generates a
mapping between the target relations and the background ontology.
The second step uses knowledge-based weak supervision to
heuristically generate new training examples for the target
relations. The third step learns an extractor from a combination of
the original and newly generated examples.  Experiments on 61
relations across two target domains with Freebase as the background
ontology show ontological smoothing can dramatically improve
precision and recall.
\end{abstract}


\input{intro}
\input{model}
%\input{inference}
\input{re}
\input{experiment}
\input{related}
\input{conclude}


\bibliography{main}{}
%\bibliographystyle{abbrv}
\bibliographystyle{aaai}

%\begin{thebibliography}{}
%
%\bibitem[\protect\citename{Aho and Ullman}1972]{Aho:72}
%Alfred~V. Aho and Jeffrey~D. Ullman.
%\newblock 1972.
%\newblock {\em The Theory of Parsing, Translation and Compiling}, volume~1.
%\newblock Prentice-{Hall}, Englewood Cliffs, NJ.
%
%\bibitem[\protect\citename{{American Psychological Association}}1983]{APA:83}
%{American Psychological Association}.
%\newblock 1983.
%\newblock {\em Publications Manual}.
%\newblock American Psychological Association, Washington, DC.
%
%\bibitem[\protect\citename{{Association for Computing Machinery}}1983]{ACM:83}
%{Association for Computing Machinery}.
%\newblock 1983.
%\newblock {\em Computing Reviews}, 24(11):503--512.
%
%\bibitem[\protect\citename{Chandra \bgroup et al.\egroup }1981]{Chandra:81}
%Ashok~K. Chandra, Dexter~C. Kozen, and Larry~J. Stockmeyer.
%\newblock 1981.
%\newblock Alternation.
%\newblock {\em Journal of the Association for Computing Machinery},
%  28(1):114--133.
%
%\bibitem[\protect\citename{Gusfield}1997]{Gusfield:97}
%Dan Gusfield.
%\newblock 1997.
%\newblock {\em Algorithms on Strings, Trees and Sequences}.
%\newblock Cambridge University Press, Cambridge, UK.
%
%\end{thebibliography}

\end{document}
